Luby Transform Codes with Priority Encoding
نویسندگان
چکیده
Rateless codes over a binary erasure channel (BEC) provide successful transmission independent of the erasure probability. Luby Transform (LT) codes and raptor codes are examples of rateless codes over a BEC. For successful decoding, LT codes require either a large overhead at linear complexity, or capacity-approaching overheads with nonlinear complexity. When overhead is low at linear complexity, LT decoding results in a large number of residual errors. In raptor codes, an erasurecorrecting low-density parity-check (LDPC) code is used as a precode to recover message symbols that cannot be recovered by the LT decoder at low overhead. Hence, raptor codes function closer to capacity than LT codes at almost linear complexity. In this paper, we propose a novel modification of the encoding method for LT codes that significantly decreases the fraction of undecoded message symbols without increasing complexity at low overheads. The effects of this modification, which we call priority encoding, have been studied through simulations. The simulations suggest that use of LT codes with priority encoding could facilitate the use of a weaker, less-complex pre-code in the construction of raptor codes.
منابع مشابه
Advanced Algorithms December 23 , 2004 Lecture 20 : LT Codes Lecturer : Amin
Random linear fountain codes were introduced in the last lecture as a sparse-graph codes for channels with erasure. It turned out that their encoding and decoding costs were quadratic and cubic in the number of packets encoded. We study Luby Transform (LT) codes in this lecture, pioneered by Michael Luby, that retains the good performance of random linear fountain code, while drastically reduci...
متن کاملUnequal error protection using LT codes and block duplication
Luby Transform (LT) codes are powerful packet erasure codes with low encoding and decoding complexity. We provide a simple method to improve the bit error rate performance of LT codes. Moreover, we exploit our method to design a new approach for unequal error protection with LT codes. We used simulations to compare our approach with a state of the art unequal error protection technique when the...
متن کاملRateless Codes for the Multicast Stream Authentication Problem
We study the multicast authentication problem when an opponent can drop, reorder and introduce data packets into the communication channel. We first study the packet authentication probability of a scheme proposed by Lysyanskaya, Tamassia and Triandopoulos in 2003 since our opponent model is based on theirs. Using a family of rateless codes called Luby Transform codes (LT codes) we design a pro...
متن کاملTransmission Control for Fast Recovery of Rateless Codes
Luby Transform (LT) codes are more important in communication applications due to the characteristics of fast encoding/decoding process, and low complexity. However, LT codes are optimal only when the number of input symbols is close to infinity. Some researches modified the degree distribution of LT codes to make LT codes suitable for short symbol length. In this article, we propose an optimal...
متن کاملOptimization Design and Analysis of Systematic LT codes over AWGN Channel
In this paper, we study systematic Luby Transform (SLT) codes over additive white Gaussian noise (AWGN) channel. We introduce the encoding scheme of SLT codes and give the bipartite graph for iterative belief propagation (BP) decoding algorithm. Similar to low-density parity-check codes, Gaussian approximation (GA) is applied to yield asymptotic performance of SLT codes. Recent work about SLT c...
متن کامل